Extremal optimal realizations
نویسنده
چکیده
An optimal realization of a metric d on a set X is a weighted graph G = (V, E, w) such that X ⊆ V , dG(x, y) = d(x, y) for all x ∈ X, and ∑ e∈E w(e) is minimal. In this paper, we consider the conjecture that any finite metric (X, d) has some optimal realization obtainable as a subgraph of its tight span. For an extremal optimal realization G, defined as an optimal realizations for which the number of geodesics is maximal, we show that the contraction of G into T (X, d) is injective. Moreover, if T (X, d) is of dimension at most two then the above conjecture holds.
منابع مشابه
On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations
Extremal eigenvalues and eigenvectors of the Laplace matrix of a graph form the core of many bounds on graph parameters and graph optimization problems. In order to advance the understanding of connections between structural properties of the graph and these eigenvectors and eigenvalues we study the problem minimizing the difference between maximum and second smallest eigenvalue over edge weigh...
متن کاملOptimizing Extremal Eigenvalues of Weighted Graph Laplacians and Associated Graph Realizations
in accordance with the requirements for the degree Dr. rer. nat.
متن کاملIndecomposable representations and oscillator realizations of the exceptional Lie algebra G 2
In this paper various representations of the exceptional Lie algebra G2 are investigated in a purely algebraic manner, and multi-boson/multi-fermion realizations are obtained. Matrix elements of the master representation, which is defined on the space of the universal enveloping algebra of G2, are explicitly determined. From this master representation, different indecomposable representations d...
متن کاملConvex Hull Realizations of the Multiplihedra
We present a simple algorithm for determining the extremal points in Euclidean space whose convex hull is the n polytope in the sequence known as the multiplihedra. This answers the open question of whether the multiplihedra could be realized as convex polytopes.
متن کاملAlgorithms and complexity results for finding graphs with extremal Randić index
We show that finding a subgraph realization with the minimum generalized Randić index for a given base graph and degree sequence is solvable in polynomial time by formulating the problem as the minimum weight perfect b-matching problem of Edmonds (J Res Natl Bur Stand 69B (1965), 125–130). However, the realization found via this reduction is not guaranteed to be connected. Approximating the min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007